On large sets of v − 1 L - intersecting
نویسندگان
چکیده
This paper presents four new recursive constructions for large sets of v − 1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n ≥ 2 a large set of 3 − 1 STS(3) whose systems intersect in 0 or 3 blocks.
منابع مشابه
On large sets of v − 1 L - intersecting Steiner triple systems of order
This paper presents four new recursive constructions for large sets of v − 1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n ≥ 2 a large set of 3 − 1 STS(3) whose systems intersect in 0 or 3 blocks.
متن کاملOn Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v
This paper presents four new recursive constructions for large sets of v − 1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n ≥ 2 a large set of 3 − 1 STS(3) whose systems intersect in 0 or 3 blocks.
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کامل3-Wise Exactly 1-Intersecting Families of Sets
Let f(l,t,n) be the maximal size of a family F ⊂ 2[n] such that any l ≥ 2 sets of F have an exactly t ≥ 1-element intersection. If l ≥ 3, it trivially comes from [8] that the optimal families are trivially intersecting (there is a t-element core contained by all the members of the family). Hence it is easy to determine f(l, t, n) = ⌊ l 2(n− 1) ⌋ +1. Let g(l, t, n) be the maximal size of an l-wi...
متن کاملAlmost Intersecting Families of Sets
Let us write DF (G) = {F ∈ F : F ∩ G = ∅} for a set G and a family F . Then a family F of sets is said to be (≤ l)-almost intersecting (l-almost intersecting) if for any F ∈ F we have |DF (F )| ≤ l (|DF (F )| = l). In this paper we investigate the problem of finding the maximum size of an (≤ l)almost intersecting (l-almost intersecting) family F . AMS Subject Classification: 05D05
متن کامل